#define _CRT_SECURE_NO_WARNINGS 1

class Solution {
public:
    int uniquePaths(int m, int n) {
        long long dp[101][101] = { {0} };
        for (int i = 1; i <= m; i++)
            for (int j = 1; j <= n; j++)
                if (i == 1 && j == 1) dp[i][j] = 1;
                else dp[i][j] = dp[i - 1][j] + dp[i][j - 1];

        return dp[m][n];
    }
};